Concurrent container scheduling on heterogeneous clusters with multi-resource constraints
نویسندگان
چکیده
منابع مشابه
Altruistic Scheduling in Multi-Resource Clusters
Given the well-known tradeoffs between fairness, performance, and efficiency, modern cluster schedulers often prefer instantaneous fairness as their primary objective to ensure performance isolation between users and groups. However, instantaneous, short-term convergence to fairness often does not result in noticeable long-term benefits. Instead, we propose an altruistic, long-term approach, CA...
متن کاملContainer loading with multi-drop constraints
In this thesis, we develop an algorithm for the container loading problem (CLP) with multi-drop constraints. The CLP is the problem of loading the maximal value of a set of boxes into a container, while ensuring that the boxes neither overlap each other nor the container walls. By adding multi-drop constraints it is further demanded, that the relevant boxes must be available, without rearrangin...
متن کاملResource efficiency in container-instance clusters
Cloud computing providers have recently begun oering container instances, which provide an ecient route to application deployment within a lightweight, isolated and well-dened execution environment. Cloud providers currently oer Container Service Platforms (CSPs), which support the exible orchestration of containerised applications. Existing CSP frameworks do not oer any form of intellige...
متن کاملScheduling Tasks Sharing Files on Heterogeneous Clusters
This paper is devoted to scheduling a large collection of independent tasks onto heterogeneous clusters. The tasks depend upon (input) files which initially reside on a master processor. A given file may well be shared by several tasks. The role of the master is to distribute the files to the processors, so that they can execute the tasks. The objective for the master is to select which file to...
متن کاملScheduling Single-Load and Multi-Load AGVs in Container Terminals
In this paper, three solutions for scheduling problem of the Single-Load and Multi-Load Automated Guided Vehicles (AGVs) in Container Terminals are proposed. The problem is formulated as Constraint Satisfaction and Optimization. When capacity of the vehicles is one container, the problem is a minimum cost flow model. This model is solved by the highest performance Algorithm, i.e. Network Simple...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Future Generation Computer Systems
سال: 2020
ISSN: 0167-739X
DOI: 10.1016/j.future.2019.08.025